Minimum spanning tree - PDFSEARCH.IO - Document Search Engine

Minimum spanning tree
Results: 280

#	Item
81	A General Technique for Fast Comprehensive Multi-Root Planning on Graphs by Coloring Vertices and Deferring Edges Christopher M. Dellin Siddhartha S. Srinivasa Add to Reading List Source URL: www.ri.cmu.edu Language: English - Date: 2015-03-03 10:29:29 Graph coloring Spanning tree Graph Routing algorithms Edge coloring Minimum spanning tree Graph theory Mathematics Theoretical computer science
82	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Approximating the Geometric Minimum-Diameter Spanning Tree Michael J. Spriggs∗ J. Mark Keil† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:30 Spanning tree Tree Planar separator theorem Steiner tree problem Graph theory Theoretical computer science Mathematics
83	ICS 161 — Algorithms — Winter 1998 — Second Midterm Name: ID: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 1998-11-13 18:59:53 Spanning tree NP-complete problems Combinatorial optimization Operations research Minimum spanning tree Routing algorithms Algorithm Matching Dynamic programming Mathematics Theoretical computer science Graph theory
84	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Terminal Steiner Tree with Bounded Edge Length Zhiyong Lin∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:29:08 NP-complete problems Spanning tree Steiner tree problem Minimum spanning tree Time complexity Approximation algorithm Rectilinear Steiner tree Theoretical computer science Graph theory Computational complexity theory
85	ICS 161 — Algorithms — Spring 2005 — Final Exam Please answer the following eight questions on the answer sheets provided. Answers written on other pages or on the wrong sheet will not be scored. Be sure to write y Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2005-06-13 12:44:12 NP-complete problems Vertex cover NP-complete Longest common subsequence problem Minimum spanning tree Algorithm Path decomposition Edge coloring Theoretical computer science Computational complexity theory Mathematics
86	CCCG 2011, Toronto ON, August 10–12, 2011 A Note on Minimum-Segment Drawings of Planar Graphs Stephane Durocher ∗† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Geometric graph theory Outerplanar graph Graph drawing Graph coloring Tree Graph Minimum spanning tree Path decomposition Angular resolution Graph theory Planar graphs Topological graph theory
87	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Terminal Steiner Tree with Bounded Edge Length Zhiyong Lin∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:29:26 NP-complete problems Spanning tree Steiner tree problem Minimum spanning tree Time complexity Approximation algorithm Rectilinear Steiner tree Theoretical computer science Graph theory Computational complexity theory
88	Algorithms Lecture 13: Randomized Minimum Cut [Fa’13] Jaques: But, for the seventh cause; how did you find the quarrel on the seventh cause? Touchstone: Upon a lie seven times removed:–bear your body more seeming, A Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:02:40 Spanning tree Combinatorial optimization Graph connectivity Analysis of algorithms Probabilistic complexity theory Randomized algorithm Minimum spanning tree Minimum cut Connectivity Theoretical computer science Mathematics Graph theory
89	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximating k-hop Minimum Spanning Trees in Euclidean Metrics∗ S¨oren Laue† Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:19 Operations research Spanning tree Complexity classes NP-complete problems Minimum spanning tree Steiner tree problem R-tree Approximation algorithm Facility location Theoretical computer science Computational complexity theory Applied mathematics
90	CCCG 2011, Toronto ON, August 10–12, 2011 A Note on Minimum-Segment Drawings of Planar Graphs Stephane Durocher ∗† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Geometric graph theory Outerplanar graph Graph drawing Graph coloring Tree Graph Minimum spanning tree Path decomposition Angular resolution Graph theory Planar graphs Topological graph theory

UPDATE